Permutation Routing and Sorting on Meshes with Row and Column Buses
نویسنده
چکیده
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into deterministic routing algorithms, and they can be implemented on a variety of diierent models of meshes with buses. We also give a deterministic algorithm for 1{1 sorting whose running time matches that for permutation routing, and another algorithm that matches the bisection lower bound on reconngurable networks of arbitrary constant dimension.
منابع مشابه
Routing and Sorting on Meshes with Row and Column Buses
We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2? 1=r)n+ ...
متن کاملRouting with locality in partitioned-bus meshes
We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing tame b y approximately one-third f o r permutation routing with locality. A matching time lower bound i s also proved. The result can be generalized to multi-packet routing.
متن کاملFast Routing on the Reconfigurable Meshmichael
We consider permutation routing problems on mesh connected processor arrays under a very weak model of reconnguration: we allow only uni-directional row or column buses, point-to-point communication, one-port-at-the-time serve by each processor. We present a scheme which is asympotically optimal for k-permutations, for any arbitrary k > 0. It works optimally on meshes of arbitrary dimensions d,...
متن کاملA Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds
We investigate the relative computational powers of a mesh with static buses and a mesh with half-duplex wrap-arounds. The latter model is like a torus, except that any wrap-around link of the architecture can only transmit data in one of the two directions at any clock tick. We show that the permutation routing problem can be solved as efficiently on a linear array augmented with a half-duplex...
متن کاملRouting with Locality on Meshes with Buses
a d 1 O(d/f(d)) step, O( f(d)) buffer size routing algorithm which is asymptotically optimal if f(d) is chosen to be a large constant. In our study, we assume all the processors operate in synchronous MIMD mode. At any time step, each processor can communicate with all of its grid neighbors and can both send and receive one packet along each mesh link. In addition, processors can also store pac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 5 شماره
صفحات -
تاریخ انتشار 1995